Scheduling algorithms

Results: 948



#Item
761Operations research / Applied mathematics / Technology / Rate-monotonic scheduling / Scheduling / Job shop scheduling / Worst-case execution time / Time complexity / Dynamic priority scheduling / Scheduling algorithms / Real-time computing / Theoretical computer science

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks Vincenzo Bonifaci∗ , Alberto Marchetti-Spaccamela† , Nicole Megow‡ , Andreas Wiese§ ∗ Istituto di Analisi dei Sistemi ed Informatica “An

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2013-10-10 18:26:14
762Complexity classes / Mathematical optimization / Analysis of algorithms / Time complexity / NP / P versus NP problem / Algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics

Algorithms and Complexity for Periodic Real-Time Scheduling VINCENZO BONIFACI, Max Planck Institute for Informatics HO-LEUNG CHAN, University of Hong Kong ALBERTO MARCHETTI-SPACCAMELA, Sapienza University of Rome NICOLE

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2013-01-02 06:56:04
763Computer programming / Scheduling algorithms / 4GL / Business intelligence / SAS / Scheduling / Computer cluster / Job scheduler / Webcron / Computing / Concurrent computing / Job scheduling

Scheduling in SAS 9.4 ® SAS® Documentation The correct bibliographic citation for this manual is as follows: SAS Institute Inc[removed]Scheduling in SAS® 9.4. Cary, NC: SAS Institute Inc.

Add to Reading List

Source URL: support.sas.com

Language: English - Date: 2013-07-08 07:05:32
764Scheduling / Probability and statistics / Decision theory / Design of experiments / Gittins index / Mathematical sciences / Determinism / Statistics / Scheduling algorithms / Operations research

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2014-06-06 08:06:12
765Embedded systems / Scheduling / Technology / Worst-case execution time / Job shop scheduling / Thorn / Computing / Scheduling algorithms / Operations research / Real-time computing

1140 IEEE TRANSACTIONS ON COMPUTERS, VOL. 61,

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2012-11-23 03:30:28
766Scheduling algorithms / Scheduling / Business / Constraint optimization / Management / Nurse scheduling problem / Planning / Constraint programming / Operations research

TE C HNI C A L R E P O R T ¨ I NFORMATIONSSYSTEME I NSTITUT F UR A BTEILUNG DATENBANKEN

Add to Reading List

Source URL: www.dbai.tuwien.ac.at

Language: English - Date: 2009-05-12 12:13:42
767Workforce management / Scheduling algorithms / Business / Scheduling / Human resource management / Management / Business software

The Channel For Industry Information Forecast Focus Dissecting the Workforce

Add to Reading List

Source URL: www.humannumbers.com

Language: English - Date: 2011-03-05 17:59:31
768Mathematics / Mathematical optimization / Approximation algorithms / Complexity classes / Planning / Job shop scheduling / Polynomial-time approximation scheme / Scheduling / Dynamic programming / Operations research / Applied mathematics / Theoretical computer science

LNCS[removed]Dual Techniques for Scheduling on a Machine with Varying Speed

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2013-07-12 04:32:05
769Complexity classes / Mathematical optimization / Operations research / Scheduling algorithms / Scheduling / NP / Interval scheduling / Graph coloring / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics

LNCS[removed]Interval Selection with Machine-Dependent Intervals

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2014-05-22 11:02:32
770Operations research / Analysis of algorithms / Mathematical optimization / Approximation algorithms / Job shop scheduling / Polynomial-time approximation scheme / Linear programming / Scheduling / Online algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio Elisabeth G¨ unther∗† Olaf Maurer∗†

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2012-11-23 03:18:02
UPDATE